By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 19, Issue 5, pp. 775-988

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

The Spatial Complexity of Oblivious $k$-Probe Hash Functions

Jeanette P. Schmidt and Alan Siegel

pp. 775-786

BibTeX  Abstract Full Text:  PDF

Domino Games and Complexity

Erich Grädel

pp. 787-804

BibTeX  Abstract Full Text:  PDF

The Hough Transform Has $O(N)$ Complexity on $N \times N$ Mesh Connected Computers

R. E. Cypher, J. L. C. Sanz, and L. Snyder

pp. 805-820

BibTeX  Abstract Full Text:  PDF

An Analysis of Random $d$-Dimensional Quad Trees

Luc Devroye and Louise Laforest

pp. 821-832

BibTeX  Abstract Full Text:  PDF

Bounded Query Classes

Klaus W. Wagner

pp. 833-846

BibTeX  Abstract Full Text:  PDF

On Three-Dimensional Packing

Keqin Li and Kam-Hoi Cheng

pp. 847-867

BibTeX  Abstract Full Text:  PDF

Postorder Disjoint Set Union is Linear

Joan M. Lucas

pp. 868-882

BibTeX  Abstract Full Text:  PDF

A Semiring on Convex Polygons and Zero-Sum Cycle Problems

Kazuo Iwano and Kenneth Steiglitz

pp. 883-901

BibTeX  Abstract Full Text:  PDF

On the Complexity of a Game Related to the Dictionary Problem

K. Mehlhorn, St. Näher, and M. Rauch

pp. 902-906

BibTeX  Abstract Full Text:  PDF

Linear-Time Test for Small Face Covers in any Fixed Surface

D. Bienstock

pp. 907-911

BibTeX  Abstract Full Text:  PDF

Optimal Size Integer Division Circuits

John H. Reif and Stephen R. Tate

pp. 912-924

BibTeX  Abstract Full Text:  PDF

Sorting Points Along an Algebraic Curve

John K. Johnstone and Chanderjit L. Bajaj

pp. 925-967

BibTeX  Abstract Full Text:  PDF

Efficient Parallel Algorithms for String Editing and Related Problems

Alberto Apostolico, Mikhail J. Atallah, Lawrence L. Larmore, and Scott McFaddin

pp. 968-988

BibTeX  Abstract Full Text:  PDF